The probability of non-confluent systems
نویسندگان
چکیده
منابع مشابه
The probability of non-confluent systems
We show how to provide a structure of probability space to the set of execution traces on a nonconfluent abstract rewrite system, by defining a variant of a Lebesgue measure on the space of traces. Then, we show how to use this probability space to transform a non-deterministic calculus into a probabilistic one. We use as example λ+, a recently introduced calculus defined through type isomorphi...
متن کاملConfluent Rewriting systems in Non-Monotonic Reasoning
Non-profit academic project, developed under the open access initiative
متن کاملNon-zero probability of nearest neighbor searching
Nearest Neighbor (NN) searching is a challenging problem in data management and has been widely studied in data mining, pattern recognition and computational geometry. The goal of NN searching is efficiently reporting the nearest data to a given object as a query. In most of the studies both the data and query are assumed to be precise, however, due to the real applications of NN searching, suc...
متن کاملWeakly-non-overlapping non-collapsing shallow term rewriting systems are confluent
This paper shows that weakly-non-overlapping, non-collapsing and shallow term rewriting systems are confluent, which is a new sufficient condition on confluence for non-left-linear systems.
متن کاملOn the inference of non-confluent NLC graph grammars
Grammar inference deals with determining (preferably simple) models/grammars consistent with a set of observations. There is a large body of research on grammar inference within the theory of formal languages. However, there is surprisingly little known on grammar inference for graph grammars. In this paper we take a further step in this direction and work within the framework of node label con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2014
ISSN: 2075-2180
DOI: 10.4204/eptcs.144.1